A 4-approximation algorithm for k-prize collecting Steiner tree problems
نویسندگان
چکیده
منابع مشابه
A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
This paper studies a 4-approximation algorithm for k-prize collecting Steiner tree problems. This problem generalizes both k-minimum spanning tree problems and prize collecting Steiner tree problems. Our proposed algorithm employs two 2-approximation algorithms for k-minimum spanning tree problems and prize collecting Steiner tree problems. Also our algorithm framework can be applied to a speci...
متن کاملElementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G= (V ,E), a collection T = {T1, . . . , Tk}, each a subset of V of size at least 2, a weight function w :E → R+, and a penalty function p :T → R+. The goal is to find a forest F that minimizes the cost of the edges of F plus the penalt...
متن کاملExact approaches for solving robust prize-collecting Steiner tree problems
In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential revenues and a set of possible links connecting these customers with fixed installation costs. The goal is to decide which customers to connect into a tree structure so that the sum of the link costs plus the revenues of the customers that are left out is minimized. The problem, as well as some o...
متن کاملA Primal-Dual based Distributed Approximation Algorithm for Prize Collecting Steiner Tree
The Prize-Collecting Steiner Tree (PCST) problem is a generalization of the Steiner Tree problem that has applications in network design, content distribution networks, and many more. There are a few centralized approximation algorithms [13, 25, 30, 6] for solving the PCST problem. However no distributed algorithm is known that solves PCST with a guaranteed approximation factor. In this work we...
متن کاملApproximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs
Abstract. We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST. We then show a (2.88+ǫ)-approximation which establishes a new best approximation guarantee for planar NWPCST. This is done by combining our LMP algorithm with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2018
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-018-1367-2